A Release Combined Scheduling Scheme for Non-Uniform Dependence Loops
نویسندگان
چکیده
In general, synchronization mechanisms can be used to preserve dependence constraints in any nested loop, and can be combined with a loop scheduling scheme to form a uniform framework to obtain the correct execution order and balance workload distribution. Most current scheduling mechanisms cannot handle non-uniform dependence loops. In this paper, we propose a new combined scheduling scheme called Release Combined Scheduling for Non-uniform Dependence Loops (RCS) to schedule non-uniform dependence doubly-nested loops in multiprocessor systems. It combines both static and dynamic scheduling mechanisms in order to optimize the system performance. In our approach, initialisation of a set of scheduling information is based on the concept of the minimum dependence distance. During runtime, scheduling information is used to adjust the number of parallelizable iterations. Our method is able to discover more parallelism from a given non-uniform dependence doubly-nested loop than is possible with previous approaches. The experimental results show that the RCS method reliably exploits parallelism and outperforms most of the existing non-uniform dependence loop scheduling schemes by 20.29%, on average.
منابع مشابه
On Effective Execution of Nonuniform DOACROSS Loops
It is extremely difficult to parallelize DOACROSS loops with non-uniform loop-carried dependences. In this paper, we present a static scheduling scheme with an accompanying synchronization strategy that can execute such DOACROSS loops effectively and efficiently. Our approach uses one of the parallelization techniques called Dependence Uniformization, which finds a small set of uniform dependen...
متن کاملA Practical Scheduling Scheme for Non-Uniform Parallel Loops on Distributed Memory Parallel Machines
Loops without dependence8 among iterations are a rich source of paTalle&sm in many applications. Among these type8 of loops, non-uniform loops with vatiable execution times need eficient scheduling schemes to take advantages of the capabilities of parallel machines. In this paper, we present a global distributed control scheme (GDC) to schedule nonuniform loops on distributed memory parallel ma...
متن کاملChain Pattern Scheduling for nested loops ∗
It is well known that most time consuming applications consist of nested DO(FOR) loops. The iterations within a loop nest can are either independent iterations or precedence constrained iterations. Furthermore, the precedence constraints can be uniform (constant) or non-uniform throughout the execution of the program. The index space of a uniform dependence loop, due to the existence of depende...
متن کاملRun-Time Parallelization for Loops
Current parallelizing compilers cannot extract a significant fraction of the available parallelism in a loop if it has a complex and/or statically insuficiently defined access pattern. In this paper, a run-time technique based on insp/exec scheme (inspector phase and executor phase) is proposed for finding parallelism on loops. Our inspector can determine the wavefronts of a loop with any compl...
متن کاملAn Efficient Scheduling of Uniform Dependence Loops
Usually the most computationally intensive part of a program is attributed to the nested loops it contains. It is therefore of interest to try to parallelize nested loops in order to reduce the overall computation time. A special category of FOR(DO) nested loops are the uniform dependence loops, which are the focus of this paper. The primary goals in this area of research are: (1) achieving the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 18 شماره
صفحات -
تاریخ انتشار 2002